<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN">
<html>
  <head>
    <meta http-equiv="Content-Type" content="text/html;charset=iso-8859-1">
      <title>GTL - Graph Template Library: fm_partition.h Source File</title>
      <link href="doxygen.css" rel="stylesheet" type="text/css">
  </head>
  <body>
    <p class="links">  
      <a href="../index.html">Home</a> |
      Documentation |
      <a href="../register.html">Download</a> |
      <a href="../platforms.html">Platforms</a> |
      <a href="../refer.html">Projects</a> |      
      <a href="../lists.html">Mailing Lists</a> |
      <a href="../history.html">Version History</a>
    </p>

<!-- Generated by Doxygen 1.5.3 -->
<div class="tabs">
  <ul>
    <li><a href="index.html"><span>Main&nbsp;Page</span></a></li>
    <li><a href="classes.html"><span>Classes</span></a></li>
    <li class="current"><a href="files.html"><span>Files</span></a></li>
    <li><a href="pages.html"><span>Related&nbsp;Pages</span></a></li>
  </ul>
</div>
<h1>fm_partition.h</h1><div class="fragment"><pre class="fragment"><a name="l00001"></a>00001 <span class="comment">//==========================================================================</span>
<a name="l00002"></a>00002 <span class="comment">//</span>
<a name="l00003"></a>00003 <span class="comment">//      fm_partition.h</span>
<a name="l00004"></a>00004 <span class="comment">//</span>
<a name="l00005"></a>00005 <span class="comment">//==========================================================================</span>
<a name="l00006"></a>00006 <span class="comment">// $Id: fm_partition.h,v 1.8 2003/01/31 08:15:05 chris Exp $</span>
<a name="l00007"></a>00007 
<a name="l00008"></a>00008 <span class="preprocessor">#ifndef GTL_FM_PARTITION_H</span>
<a name="l00009"></a>00009 <span class="preprocessor"></span><span class="preprocessor">#define GTL_FM_PARTITION_H</span>
<a name="l00010"></a>00010 <span class="preprocessor"></span>
<a name="l00011"></a>00011 <span class="preprocessor">#include &lt;GTL/GTL.h&gt;</span>
<a name="l00012"></a>00012 <span class="preprocessor">#include &lt;GTL/graph.h&gt;</span>
<a name="l00013"></a>00013 <span class="preprocessor">#include &lt;GTL/node_map.h&gt;</span>
<a name="l00014"></a>00014 <span class="preprocessor">#include &lt;GTL/edge_map.h&gt;</span>
<a name="l00015"></a>00015 <span class="preprocessor">#include &lt;GTL/algorithm.h&gt;</span>
<a name="l00016"></a>00016 
<a name="l00017"></a>00017 __GTL_BEGIN_NAMESPACE
<a name="l00018"></a>00018 
<a name="l00019"></a>00019 
<a name="l00032"></a><a class="code" href="a00012.html">00032</a> <span class="keyword">class </span>GTL_EXTERN <a class="code" href="a00012.html" title="Heuristic graph bi-partitioning algorithm (Fiduccia-Mattheyses).">fm_partition</a> : <span class="keyword">public</span> <a class="code" href="a00001.html" title="Abstract baseclass for all algoritm-classes.">algorithm</a>
<a name="l00033"></a>00033 {
<a name="l00034"></a>00034 <span class="keyword">public</span>:
<a name="l00041"></a><a class="code" href="a00012.html#7cdff1bea3740a287387e8408e16ca79">00041</a>     <span class="keyword">typedef</span> <span class="keywordtype">int</span> side_type;
<a name="l00042"></a>00042 
<a name="l00048"></a><a class="code" href="a00012.html#14f3549e41c99cec77c643f0b7bbebeb">00048</a>     <span class="keyword">const</span> <span class="keyword">static</span> side_type A;
<a name="l00049"></a>00049 
<a name="l00055"></a><a class="code" href="a00012.html#88a3757f1b287218977618640e34dbf6">00055</a>     <span class="keyword">const</span> <span class="keyword">static</span> side_type B;
<a name="l00056"></a>00056 
<a name="l00064"></a><a class="code" href="a00012.html#63693cd93d587dca3d1842f831cd1c55">00064</a>     <span class="keyword">typedef</span> <span class="keywordtype">short</span> <span class="keywordtype">int</span> fix_type;
<a name="l00065"></a>00065 
<a name="l00071"></a><a class="code" href="a00012.html#9d46a0a260c01dcf9746bf174694f026">00071</a>     <span class="keyword">const</span> <span class="keyword">static</span> fix_type FIXA;
<a name="l00072"></a>00072 
<a name="l00078"></a><a class="code" href="a00012.html#9c5ae8bac2a663c7574960c679ec7aa8">00078</a>     <span class="keyword">const</span> <span class="keyword">static</span> fix_type FIXB;
<a name="l00079"></a>00079 
<a name="l00085"></a><a class="code" href="a00012.html#fa0678441747b1ac581f08fd55e27d4a">00085</a>     <span class="keyword">const</span> <span class="keyword">static</span> fix_type UNFIXED;
<a name="l00086"></a>00086 
<a name="l00092"></a>00092     <a class="code" href="a00012.html" title="Heuristic graph bi-partitioning algorithm (Fiduccia-Mattheyses).">fm_partition</a>();
<a name="l00093"></a>00093 
<a name="l00099"></a>00099     <span class="keyword">virtual</span> ~<a class="code" href="a00012.html" title="Heuristic graph bi-partitioning algorithm (Fiduccia-Mattheyses).">fm_partition</a>();
<a name="l00100"></a>00100 
<a name="l00110"></a>00110     <span class="keywordtype">void</span> set_vars(<span class="keyword">const</span> <a class="code" href="a00014.html" title="A directed or undirected graph.">graph</a>&amp; G, <span class="keyword">const</span> <a class="code" href="a00021.html" title="A specialized map with nodes as keys.">node_map&lt;int&gt;</a>&amp; node_weight,
<a name="l00111"></a>00111         <span class="keyword">const</span> <a class="code" href="a00011.html" title="A specialized map with edges as keys.">edge_map&lt;int&gt;</a>&amp; edge_weight);
<a name="l00112"></a>00112 
<a name="l00125"></a>00125     <span class="keywordtype">void</span> set_vars(<span class="keyword">const</span> <a class="code" href="a00014.html" title="A directed or undirected graph.">graph</a>&amp; G, <span class="keyword">const</span> <a class="code" href="a00021.html" title="A specialized map with nodes as keys.">node_map&lt;int&gt;</a>&amp; node_weight,
<a name="l00126"></a>00126         <span class="keyword">const</span> <a class="code" href="a00011.html" title="A specialized map with edges as keys.">edge_map&lt;int&gt;</a>&amp; edge_weight,
<a name="l00127"></a>00127         <span class="keyword">const</span> <a class="code" href="a00021.html" title="A specialized map with nodes as keys.">node_map&lt;side_type&gt;</a>&amp; init_side);
<a name="l00128"></a>00128 
<a name="l00139"></a>00139     <span class="keywordtype">void</span> set_vars(<span class="keyword">const</span> <a class="code" href="a00014.html" title="A directed or undirected graph.">graph</a>&amp; G, <span class="keyword">const</span> <a class="code" href="a00021.html" title="A specialized map with nodes as keys.">node_map&lt;int&gt;</a>&amp; node_weight,
<a name="l00140"></a>00140         <span class="keyword">const</span> <a class="code" href="a00011.html" title="A specialized map with edges as keys.">edge_map&lt;int&gt;</a>&amp; edge_weight,
<a name="l00141"></a>00141         <span class="keyword">const</span> <a class="code" href="a00021.html" title="A specialized map with nodes as keys.">node_map&lt;fix_type&gt;</a>&amp; fixed);
<a name="l00142"></a>00142 
<a name="l00157"></a>00157     <span class="keywordtype">void</span> set_vars(<span class="keyword">const</span> <a class="code" href="a00014.html" title="A directed or undirected graph.">graph</a>&amp; G, <span class="keyword">const</span> <a class="code" href="a00021.html" title="A specialized map with nodes as keys.">node_map&lt;int&gt;</a>&amp; node_weight,
<a name="l00158"></a>00158         <span class="keyword">const</span> <a class="code" href="a00011.html" title="A specialized map with edges as keys.">edge_map&lt;int&gt;</a>&amp; edge_weight,
<a name="l00159"></a>00159         <span class="keyword">const</span> <a class="code" href="a00021.html" title="A specialized map with nodes as keys.">node_map&lt;side_type&gt;</a>&amp; init_side,
<a name="l00160"></a>00160         <span class="keyword">const</span> <a class="code" href="a00021.html" title="A specialized map with nodes as keys.">node_map&lt;fix_type&gt;</a>&amp; fixed);
<a name="l00161"></a>00161 
<a name="l00171"></a>00171     <span class="keywordtype">void</span> store_cut_edges(<span class="keyword">const</span> <span class="keywordtype">bool</span> <span class="keyword">set</span>);
<a name="l00172"></a>00172 
<a name="l00184"></a>00184     <span class="keywordtype">void</span> store_nodesAB(<span class="keyword">const</span> <span class="keywordtype">bool</span> <span class="keyword">set</span>);
<a name="l00185"></a>00185 
<a name="l00201"></a>00201     <span class="keyword">virtual</span> <span class="keywordtype">int</span> <a class="code" href="a00001.html#76361fb03ad1cf643affc51821e43bed" title="Checks whether all preconditions are satisfied.">check</a>(<a class="code" href="a00014.html" title="A directed or undirected graph.">graph</a>&amp; G);
<a name="l00202"></a>00202 
<a name="l00213"></a>00213     <span class="keywordtype">int</span> <a class="code" href="a00001.html#734b189509a8d6b56b65f8ff772d43ca" title="Applies algorithm to graph g.">run</a>(<a class="code" href="a00014.html" title="A directed or undirected graph.">graph</a>&amp; G);
<a name="l00214"></a>00214 
<a name="l00220"></a>00220     <span class="keywordtype">int</span> get_cutsize();
<a name="l00221"></a>00221 
<a name="l00228"></a>00228     <span class="keywordtype">int</span> get_needed_passes();
<a name="l00229"></a>00229                 
<a name="l00237"></a>00237     side_type get_side_of_node(<span class="keyword">const</span> <a class="code" href="a00020.html" title="A node in a graph.">node</a>&amp; n) <span class="keyword">const</span>;
<a name="l00238"></a>00238 
<a name="l00247"></a>00247     side_type operator [](<span class="keyword">const</span> <a class="code" href="a00020.html" title="A node in a graph.">node</a>&amp; n) <span class="keyword">const</span>;
<a name="l00248"></a>00248                                 
<a name="l00255"></a>00255     <span class="keywordtype">int</span> get_weight_on_sideA(<span class="keyword">const</span> <a class="code" href="a00014.html" title="A directed or undirected graph.">graph</a>&amp; G) <span class="keyword">const</span>;
<a name="l00256"></a>00256 
<a name="l00263"></a>00263     <span class="keywordtype">int</span> get_weight_on_sideB(<span class="keyword">const</span> <a class="code" href="a00014.html" title="A directed or undirected graph.">graph</a>&amp; G) <span class="keyword">const</span>;
<a name="l00264"></a>00264 
<a name="l00268"></a><a class="code" href="a00012.html#ede10aea3dda6be8014ce60fca728efe">00268</a>     <span class="keyword">typedef</span> list&lt;edge&gt;::const_iterator cut_edges_iterator;
<a name="l00269"></a>00269 
<a name="l00278"></a>00278     cut_edges_iterator cut_edges_begin() <span class="keyword">const</span>;
<a name="l00279"></a>00279 
<a name="l00288"></a>00288     cut_edges_iterator cut_edges_end() <span class="keyword">const</span>;
<a name="l00289"></a>00289                 
<a name="l00293"></a><a class="code" href="a00012.html#c8b7b5253476118e5f7bbad2fe8af285">00293</a>     <span class="keyword">typedef</span> list&lt;node&gt;::const_iterator nodes_of_one_side_iterator;
<a name="l00294"></a>00294 
<a name="l00302"></a>00302     nodes_of_one_side_iterator nodes_of_sideA_begin() <span class="keyword">const</span>;
<a name="l00303"></a>00303 
<a name="l00312"></a>00312     nodes_of_one_side_iterator nodes_of_sideA_end() <span class="keyword">const</span>;
<a name="l00313"></a>00313 
<a name="l00321"></a>00321     nodes_of_one_side_iterator nodes_of_sideB_begin() <span class="keyword">const</span>;
<a name="l00322"></a>00322 
<a name="l00331"></a>00331     nodes_of_one_side_iterator nodes_of_sideB_end() <span class="keyword">const</span>;
<a name="l00332"></a>00332 
<a name="l00339"></a>00339     <span class="keyword">virtual</span> <span class="keywordtype">void</span> <a class="code" href="a00001.html#21aba63d066ae7897de6ca7d8425c408" title="Resets algorithm.">reset</a>();
<a name="l00340"></a>00340 <span class="keyword">protected</span>:
<a name="l00346"></a>00346     <span class="keywordtype">bool</span> enable_cut_edges_storing;
<a name="l00347"></a>00347                 
<a name="l00352"></a>00352     list&lt;edge&gt; cut_edges;
<a name="l00353"></a>00353 
<a name="l00359"></a>00359     <span class="keywordtype">bool</span> enable_nodesAB_storing;
<a name="l00360"></a>00360                 
<a name="l00365"></a>00365     list&lt;node&gt; nodesA;
<a name="l00366"></a>00366 
<a name="l00371"></a>00371     list&lt;node&gt; nodesB;
<a name="l00372"></a>00372 
<a name="l00379"></a>00379     <span class="keywordtype">bool</span> set_vars_executed;
<a name="l00380"></a>00380                 
<a name="l00386"></a>00386     <span class="keywordtype">bool</span> provided_initial_part;
<a name="l00387"></a>00387                 
<a name="l00393"></a>00393     <span class="keywordtype">bool</span> provided_fix;
<a name="l00394"></a>00394                 
<a name="l00399"></a>00399     <a class="code" href="a00021.html" title="A specialized map with nodes as keys.">node_map&lt;fix_type&gt;</a> fixed;
<a name="l00400"></a>00400 
<a name="l00406"></a>00406     <a class="code" href="a00021.html" title="A specialized map with nodes as keys.">node_map&lt;int&gt;</a> node_weight;
<a name="l00407"></a>00407 
<a name="l00413"></a>00413     <span class="keywordtype">int</span> max_node_weight;
<a name="l00414"></a>00414 
<a name="l00420"></a>00420     <a class="code" href="a00011.html" title="A specialized map with edges as keys.">edge_map&lt;int&gt;</a> edge_weight;
<a name="l00421"></a>00421 
<a name="l00427"></a>00427     <span class="keywordtype">int</span> max_edge_weight;
<a name="l00428"></a>00428 
<a name="l00434"></a>00434     <span class="keywordtype">int</span> total_node_weight;
<a name="l00435"></a>00435 
<a name="l00441"></a>00441     <span class="keywordtype">int</span> node_weight_on_sideA;
<a name="l00442"></a>00442 
<a name="l00448"></a>00448     <span class="keywordtype">int</span> node_weight_on_sideB;
<a name="l00449"></a>00449 
<a name="l00454"></a>00454     <a class="code" href="a00021.html" title="A specialized map with nodes as keys.">node_map&lt;side_type&gt;</a> side;
<a name="l00455"></a>00455 
<a name="l00460"></a>00460     <a class="code" href="a00021.html" title="A specialized map with nodes as keys.">node_map&lt;list&lt;node&gt;::iterator</a>&gt; position_in_bucket;
<a name="l00461"></a>00461                 
<a name="l00466"></a>00466     <span class="keywordtype">int</span> max_vertex_degree;
<a name="l00467"></a>00467 
<a name="l00472"></a>00472     <a class="code" href="a00011.html" title="A specialized map with edges as keys.">edge_map&lt;int&gt;</a> aside;
<a name="l00473"></a>00473 
<a name="l00478"></a>00478     <a class="code" href="a00011.html" title="A specialized map with edges as keys.">edge_map&lt;int&gt;</a> bside;
<a name="l00479"></a>00479 
<a name="l00485"></a>00485     <a class="code" href="a00011.html" title="A specialized map with edges as keys.">edge_map&lt;list&lt;node&gt;</a> &gt; unlockedA;
<a name="l00486"></a>00486 
<a name="l00492"></a>00492     <a class="code" href="a00011.html" title="A specialized map with edges as keys.">edge_map&lt;list&lt;node&gt;</a> &gt; unlockedB;
<a name="l00493"></a>00493 
<a name="l00498"></a>00498     <a class="code" href="a00021.html" title="A specialized map with nodes as keys.">node_map&lt;int&gt;</a> gain_value;
<a name="l00499"></a>00499 
<a name="l00504"></a>00504     <span class="keywordtype">bool</span> bucketA_empty;
<a name="l00505"></a>00505 
<a name="l00510"></a>00510     <span class="keywordtype">bool</span> bucketB_empty;
<a name="l00511"></a>00511 
<a name="l00517"></a>00517     <span class="keywordtype">int</span> max_gainA;
<a name="l00518"></a>00518 
<a name="l00524"></a>00524     <span class="keywordtype">int</span> max_gainB;
<a name="l00525"></a>00525 
<a name="l00532"></a>00532     vector&lt;list&lt;node&gt; &gt; bucketA;
<a name="l00533"></a>00533 
<a name="l00540"></a>00540     vector&lt;list&lt;node&gt; &gt; bucketB;
<a name="l00541"></a>00541 
<a name="l00547"></a>00547     <span class="keywordtype">int</span> cur_cutsize;
<a name="l00548"></a>00548 
<a name="l00553"></a>00553     <span class="keywordtype">int</span> no_passes;
<a name="l00554"></a>00554 
<a name="l00560"></a>00560     <span class="keywordtype">void</span> divide_up(<span class="keyword">const</span> <a class="code" href="a00014.html" title="A directed or undirected graph.">graph</a>&amp; G);
<a name="l00561"></a>00561 
<a name="l00566"></a>00566     <span class="keywordtype">void</span> hide_self_loops(<a class="code" href="a00014.html" title="A directed or undirected graph.">graph</a>&amp; G);
<a name="l00567"></a>00567 
<a name="l00573"></a>00573     <span class="keywordtype">void</span> init_variables(<span class="keyword">const</span> <a class="code" href="a00014.html" title="A directed or undirected graph.">graph</a>&amp; G);
<a name="l00574"></a>00574                 
<a name="l00581"></a>00581     <span class="keywordtype">void</span> create_initial_bipart(<span class="keyword">const</span> <a class="code" href="a00014.html" title="A directed or undirected graph.">graph</a>&amp; G);
<a name="l00582"></a>00582 
<a name="l00588"></a>00588     <span class="keywordtype">void</span> shuffle_vector(<span class="keyword">const</span> <span class="keywordtype">int</span> vector_size,
<a name="l00589"></a>00589         vector&lt;graph::node_iterator&gt;&amp; node_vector);
<a name="l00590"></a>00590                 
<a name="l00595"></a>00595     <span class="keywordtype">void</span> compute_max_vertex_degree(<span class="keyword">const</span> <a class="code" href="a00014.html" title="A directed or undirected graph.">graph</a>&amp; G);
<a name="l00596"></a>00596 
<a name="l00601"></a>00601     <span class="keywordtype">void</span> pass_manager(<span class="keyword">const</span> <a class="code" href="a00014.html" title="A directed or undirected graph.">graph</a>&amp; G);
<a name="l00602"></a>00602 
<a name="l00607"></a>00607     <span class="keywordtype">void</span> copy_side_node_map(<span class="keyword">const</span> <a class="code" href="a00014.html" title="A directed or undirected graph.">graph</a>&amp; G, <a class="code" href="a00021.html" title="A specialized map with nodes as keys.">node_map&lt;side_type&gt;</a>&amp; dest,
<a name="l00608"></a>00608         <span class="keyword">const</span> <a class="code" href="a00021.html" title="A specialized map with nodes as keys.">node_map&lt;side_type&gt;</a> source) <span class="keyword">const</span>;
<a name="l00609"></a>00609                         
<a name="l00614"></a>00614     <span class="keywordtype">void</span> init_data_structure(<span class="keyword">const</span> <a class="code" href="a00014.html" title="A directed or undirected graph.">graph</a>&amp; G);
<a name="l00615"></a>00615                 
<a name="l00621"></a>00621     <span class="keywordtype">void</span> init_filling_buckets(<span class="keyword">const</span> <a class="code" href="a00014.html" title="A directed or undirected graph.">graph</a>&amp; G);
<a name="l00622"></a>00622 
<a name="l00628"></a>00628     <span class="keywordtype">int</span> inital_gain_of_node_on_sideA(<span class="keyword">const</span> <a class="code" href="a00020.html" title="A node in a graph.">node</a> cur_node);
<a name="l00629"></a>00629 
<a name="l00635"></a>00635     <span class="keywordtype">int</span> inital_gain_of_node_on_sideB(<span class="keyword">const</span> <a class="code" href="a00020.html" title="A node in a graph.">node</a> cur_node);
<a name="l00636"></a>00636 
<a name="l00641"></a>00641     <span class="keywordtype">void</span> move_manager(<span class="keyword">const</span> <a class="code" href="a00014.html" title="A directed or undirected graph.">graph</a>&amp; G);
<a name="l00642"></a>00642 
<a name="l00649"></a>00649     <span class="keywordtype">bool</span> move_vertex(<span class="keyword">const</span> <a class="code" href="a00014.html" title="A directed or undirected graph.">graph</a>&amp; G, <a class="code" href="a00020.html" title="A node in a graph.">node</a>&amp; moved_node);
<a name="l00650"></a>00650 
<a name="l00657"></a>00657     <span class="keywordtype">bool</span> balance_holds(<span class="keyword">const</span> <a class="code" href="a00014.html" title="A directed or undirected graph.">graph</a>&amp; G, <span class="keyword">const</span> <a class="code" href="a00020.html" title="A node in a graph.">node</a> cur_node);
<a name="l00658"></a>00658 
<a name="l00664"></a>00664     <span class="keywordtype">void</span> update_data_structure_A2B(<span class="keyword">const</span> <a class="code" href="a00020.html" title="A node in a graph.">node</a> cur_node);
<a name="l00665"></a>00665 
<a name="l00671"></a>00671     <span class="keywordtype">void</span> update_data_structure_B2A(<span class="keyword">const</span> <a class="code" href="a00020.html" title="A node in a graph.">node</a> cur_node);
<a name="l00672"></a>00672                 
<a name="l00678"></a>00678     <span class="keywordtype">void</span> update_bucketA(<span class="keyword">const</span> <a class="code" href="a00020.html" title="A node in a graph.">node</a> cur_node, <span class="keyword">const</span> <span class="keywordtype">int</span> old_gain,
<a name="l00679"></a>00679         <span class="keyword">const</span> <span class="keywordtype">int</span> new_gain);
<a name="l00680"></a>00680 
<a name="l00686"></a>00686     <span class="keywordtype">void</span> update_bucketB(<span class="keyword">const</span> <a class="code" href="a00020.html" title="A node in a graph.">node</a> cur_node, <span class="keyword">const</span> <span class="keywordtype">int</span> old_gain,
<a name="l00687"></a>00687         <span class="keyword">const</span> <span class="keywordtype">int</span> new_gain);
<a name="l00688"></a>00688                 
<a name="l00694"></a>00694     <span class="keywordtype">void</span> update_max_gain(<span class="keyword">const</span> side_type side);
<a name="l00695"></a>00695 
<a name="l00701"></a>00701     <span class="keyword">inline</span> <span class="keywordtype">int</span> range_up(<span class="keyword">const</span> <span class="keywordtype">int</span> gain_value) <span class="keyword">const</span>;
<a name="l00702"></a>00702 
<a name="l00708"></a>00708     <span class="keyword">inline</span> <span class="keywordtype">int</span> range_down(<span class="keyword">const</span> <span class="keywordtype">int</span> index) <span class="keyword">const</span>;
<a name="l00709"></a>00709 
<a name="l00714"></a>00714     <span class="keywordtype">void</span> clean_pass(<span class="keyword">const</span> <a class="code" href="a00014.html" title="A directed or undirected graph.">graph</a>&amp; G);
<a name="l00715"></a>00715                 
<a name="l00720"></a>00720     <span class="keywordtype">void</span> compute_cut_edges(<span class="keyword">const</span> <a class="code" href="a00014.html" title="A directed or undirected graph.">graph</a>&amp; G);
<a name="l00721"></a>00721 
<a name="l00726"></a>00726     <span class="keywordtype">void</span> compute_nodesAB(<span class="keyword">const</span> <a class="code" href="a00014.html" title="A directed or undirected graph.">graph</a>&amp; G);
<a name="l00727"></a>00727 <span class="keyword">private</span>:
<a name="l00728"></a>00728 <span class="preprocessor">#ifdef _DEBUG</span>
<a name="l00729"></a>00729 <span class="preprocessor"></span>
<a name="l00733"></a>00733     <span class="keywordtype">void</span> print_bucketA();
<a name="l00734"></a>00734 
<a name="l00739"></a>00739     <span class="keywordtype">void</span> print_bucketB();
<a name="l00740"></a>00740 <span class="preprocessor">#endif  // _DEBUG</span>
<a name="l00741"></a>00741 <span class="preprocessor"></span>};
<a name="l00742"></a>00742 
<a name="l00743"></a>00743 
<a name="l00744"></a>00744 __GTL_END_NAMESPACE
<a name="l00745"></a>00745 
<a name="l00746"></a>00746 <span class="preprocessor">#endif // GTL_FM_PARTITION_H</span>
<a name="l00747"></a>00747 <span class="preprocessor"></span>
<a name="l00748"></a>00748 <span class="comment">//--------------------------------------------------------------------------</span>
<a name="l00749"></a>00749 <span class="comment">//   end of file</span>
<a name="l00750"></a>00750 <span class="comment">//--------------------------------------------------------------------------</span>
</pre></div>    <p class="links">
      <a href="http://www.uni-passau.de/">University of Passau</a>
      &nbsp;-&nbsp;
      <a href="http://www.fmi.uni-passau.de/">FMI</a>
      &nbsp;-&nbsp;
      <a href="http://www.fmi.uni-passau.de/fmi/lehrstuehle/brandenburg/">Theoretical
	Computer Science</a>
    </p>
  <div class="copyright">
      Design &copy; 2002, 2003 <a href="mailto:raitner@fmi.uni-passau.de">Marcus Raitner</a>,  University of Passau 
  </div>
</body>
</html>
